A Markov Process for Sequential Allocation
نویسنده
چکیده
We describe a Markov process which models the sequential allocation for two adjacent tables coexisting in memory by growing towards each other. The tables are expected to ll at the same rate; random deletions and insertions are allowed.
منابع مشابه
Optimizing Red Blood Cells Consumption Using Markov Decision Process
In healthcare systems, one of the important actions is related to perishable products such as red blood cells (RBCs) units that its consumption management in different periods can contribute greatly to the optimality of the system. In this paper, main goal is to enhance the ability of medical community to organize the RBCs units’ consumption in way to deliver the unit order timely with a focus ...
متن کاملA MARKOV PROCESS FOR SEQUENTIALALLOCATIONC at
We describe a Markov process which models the sequential allocation for two adjacent tables coexisting in memory by growing towards each other. The tables are expected to ll at the same rate; random deletions and insertions are allowed.
متن کاملCold standby redundancy optimization for nonrepairable series-parallel systems: Erlang time to failure distribution
In modeling a cold standby redundancy allocation problem (RAP) with imperfect switching mechanism, deriving a closed form version of a system reliability is too difficult. A convenient lower bound on system reliability is proposed and this approximation is widely used as a part of objective function for a system reliability maximization problem in the literature. Considering this lower bound do...
متن کاملOptimal time-consistent monetary and fiscal policy under sticky prices
This paper studies optimal monetary and fiscal policy in a stochastic economy with sticky prices and monopolistic competition on its product markets. Our main objective is to characterize optimal time-consistent (Markov) policies and to compare their characteristics to the ones implemented by a Ramsey policy maker. We perform this comparison within the framework of a stochastic production econo...
متن کاملAn Efficient Model for Dynamic and Constrained Resource Allocation Problems
Dynamic constraint satisfaction is a useful tool for representing and solving sequential decision problems with complete knowledge in dynamic world and particularly constrained resource allocation problems. However, when resources are unreliable, this framework becomes limited due to the stochastic outcomes of the assignments chosen. On the contrary, Markov Decision Processes (MDPs) handle stoc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. UCS
دوره 1 شماره
صفحات -
تاریخ انتشار 1995